The Dirty MIMO Multiple-Access Channel
نویسندگان
چکیده
منابع مشابه
The Robustness of Dirty Paper Coding and The Binary Dirty Multiple Access Channel with Common Interference
A dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates for the imprecise channel knowledge. We focus on a communication scenario where the signalto-noise ratio is high. Our...
متن کاملMIMO Multiple Access Channel with an Arbitrarily Varying Eavesdropper
A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix of the eavesdropper is arbitrarily varying and only known to the eavesdropper. The secrecy degrees of freedom (s.d.o.f.) region under a strong secrecy const...
متن کاملThe Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution when exists has a “single-letter” form. This reflects the fact that optimum performance can be approached by a random code (or a random binning scheme), generated using independent and identically distributed copies of some single-letter distribution. Is that the form of the solution of any (information theoretic) proble...
متن کاملThe Rate Loss of Single-Letter Characterization for the “Dirty” Multiple Access Channel
For general memoryless systems, the typical information theoretic solution, when exists, has a “single-letter” form. This reflects the fact that optimum performance can be approached by a random code (or a random binning scheme), generated using independent and identically distributed copies of some single-letter distribution. Is that the form of the solution of any (information theoretic) prob...
متن کاملDirty-Paper Coding for the Multi-Access Channel with Conferencing
We derive the capacity region of the two-user dirtypaper Gaussian multi-access channel (MAC) with conferencing encoders. In this MAC, prior to each transmission block, the transmitters can hold a conference in which they can communicate with each other over error-free bit-pipes of given capacities. The received signal suffers not only from additive Gaussian noise but also from additive interfer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2698443